On the separation of split inequalities for non-convex quadratic integer programming
نویسندگان
چکیده
منابع مشابه
On the separation of split inequalities for non-convex quadratic integer programming
We investigate the computational potential of split inequalities for non-convex quadratic integer programming, first introduced by Letchford [11] and further examined by Burer and Letchford [8]. These inequalities can be separated by solving convex quadratic integer minimization problems. For small instances with box-constraints, we show that the resulting dual bounds are very tight; they can c...
متن کاملUnbounded convex sets for non-convex mixed-integer quadratic programming
This paper introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some o...
متن کاملGap inequalities for non-convex mixed-integer quadratic programs
Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general nonconvex mixed-integer quadratic programs. These inequalities dominate some inequalities arising from a natural semidefinite relaxation.
متن کاملSemidefinite relaxations for non-convex quadratic mixed-integer programming
We present semidefinite relaxations for unconstrained nonconvex quadratic mixed-integer optimization problems. These relaxations yield tight bounds and are computationally easy to solve for mediumsized instances, even if some of the variables are integer and unbounded. In this case, the problem contains an infinite number of linear constraints; these constraints are separated dynamically. We us...
متن کاملQuadratic Outer Approximation for Convex Integer Programming
We present a quadratic outer approximation scheme for solving general convex integer programs, where suitable quadratic approximations are used to underestimate the objective function instead of classical linear approximations. As a resulting surrogate problem we consider the problem of minimizing a function given as the maximum of finitely many convex quadratic functions having the same Hessia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.08.002